| for x in range(len(hashTable)): |
| if idx == len(hashTable): |
| if hashTable[idx] == item: |
| def itemToFind(item): |
| return False |
| return True |
| if hashTable[idx] == None: |
| idx = item%10 |
| idx = 0 |
| return False |
| idx = idx + 1 |
|     for x in range(len(hashTable)): |
|         if idx == len(hashTable): |
|         if hashTable[idx] == item: |
| def itemToFind(item): |
|             return False |
|             return True |
|         if hashTable[idx] == None: |
|     idx = item%10 |
|             idx = 0 |
|     return False |
|         idx = idx + 1 |
| 1 | def itemToFind(item): |
| 2 |     idx = item%10 |
| 3 |     for x in range(len(hashTable)): |
| 4 |         if hashTable[idx] == item: |
| 5 |             return True |
| 6 |         if hashTable[idx] == None: |
| 7 |             return False |
| 8 |         idx = idx + 1 |
| 9 |         if idx == len(hashTable): |
| 10 |             idx = 0 |
| 11 |     return False |
| multi = 2 |
| 86, 'p': 149, 'q': 88, 'r': 72, 's': 195, 't': 91, 'u': 84, 'v': 95, 'w': 41, 'x': 20, 'y': 176, 'z': 59} |
| total = total - alpha[char] * multi |
| else: |
| multi = 1 |
| total = 0 |
| def hashFunction(item): |
| total = total % 10 |
| alpha = {'a': 82, 'b': 174, 'c': 70, 'd': 12, 'e': 199, 'f': 40, 'g': 49, 'h': 36, 'i': 138, 'j': 158, 'k': 127, 'l': 103, 'm': 28, 'n': 134, 'o': |
| if alpha[char] % 2 == 0: |
| for char in item: |
| return total |
| char = char.lower() |
| if char.lower() != char: |
| total = total + alpha[char] * multi |
|             multi = 2 |
| 86, 'p': 149, 'q': 88, 'r': 72, 's': 195, 't': 91, 'u': 84, 'v': 95, 'w': 41, 'x': 20, 'y': 176, 'z': 59} |
|             total = total - alpha[char] * multi |
|         else: |
|         multi = 1 |
|     total = 0 |
| def hashFunction(item): |
|     total = total % 10 |
|     alpha = {'a': 82, 'b': 174, 'c': 70, 'd': 12, 'e': 199, 'f': 40, 'g': 49, 'h': 36, 'i': 138, 'j': 158, 'k': 127, 'l': 103, 'm': 28, 'n': 134, 'o': |
|         if alpha[char] % 2 == 0: |
|     for char in item: |
|     return total |
|             char = char.lower() |
|         if char.lower() != char: |
|             total = total + alpha[char] * multi |
| 1 | def hashFunction(item): |
| 2 |     alpha = {'a': 82, 'b': 174, 'c': 70, 'd': 12, 'e': 199, 'f': 40, 'g': 49, 'h': 36, 'i': 138, 'j': 158, 'k': 127, 'l': 103, 'm': 28, 'n': 134, 'o': |
| 3 | 86, 'p': 149, 'q': 88, 'r': 72, 's': 195, 't': 91, 'u': 84, 'v': 95, 'w': 41, 'x': 20, 'y': 176, 'z': 59} |
| 4 |     total = 0 |
| 5 |     for char in item: |
| 6 |         multi = 1 |
| 7 |         if char.lower() != char: |
| 8 |             char = char.lower() |
| 9 |             multi = 2 |
| 10 |         if alpha[char] % 2 == 0: |
| 11 |             total = total + alpha[char] * multi |
| 12 |         else: |
| 13 |             total = total - alpha[char] * multi |
| 14 |     total = total % 10 |
| 15 |     return total |
| def itemToFind(item): |
| for x in range(len(hashTable)): |
| idx = 0 |
| if idx == len(hashTable): |
| return True |
| return False |
| return False |
| if hashTable[idx] == None: |
| if hashTable[idx] == item: |
| idx = hashFunction(item) |
| idx = idx + 1 |
| def itemToFind(item): |
|     for x in range(len(hashTable)): |
|             idx = 0 |
|         if idx == len(hashTable): |
|             return True |
|             return False |
|     return False |
|         if hashTable[idx] == None: |
|         if hashTable[idx] == item: |
|     idx = hashFunction(item) |
|         idx = idx + 1 |
| 1 | def itemToFind(item): |
| 2 |     idx = hashFunction(item) |
| 3 |     for x in range(len(hashTable)): |
| 4 |         if hashTable[idx] == item: |
| 5 |             return True |
| 6 |         if hashTable[idx] == None: |
| 7 |             return False |
| 8 |         idx = idx + 1 |
| 9 |         if idx == len(hashTable): |
| 10 |             idx = 0 |
| 11 |     return False |
| def itemToFind(id): |
| if hashTable[idx] == None: |
| for x in range(len(hashTable)): |
| return False |
| idx = idx + 1 |
| return False |
| idx = 0 |
| if idx == len(hashTable): |
| idx = id%160 |
| if hashTable[idx]["id"] == id: |
| return True |
| def itemToFind(id): |
|         if hashTable[idx] == None: |
|     for x in range(len(hashTable)): |
|     return False |
|         idx = idx + 1 |
|             return False |
|             idx = 0 |
|         if idx == len(hashTable): |
|     idx = id%160 |
|         if hashTable[idx]["id"] == id: |
|             return True |
| 1 | def itemToFind(id): |
| 2 |     idx = id%160 |
| 3 |     for x in range(len(hashTable)): |
| 4 |         if hashTable[idx] == None: |
| 5 |             return False |
| 6 |         if hashTable[idx]["id"] == id: |
| 7 |             return True |
| 8 |         idx = idx + 1 |
| 9 |         if idx == len(hashTable): |
| 10 |             idx = 0 |
| 11 |     return False |
| if idx == len(hashTable): |
| return count |
| idx = id%160 |
| return 0 |
| return 0 |
| for x in range(len(hashTable)): |
| total = 0 |
| if hashTable[idx] == None: |
| idx = idx + 1 |
| continue |
| count = 0 |
| for item in hashTable: |
| count = count + 1 |
| total = total + itemToFind(item["id"]) |
| if item == None: |
| def itemToFind(id): |
| idx = 0 |
| if hashTable[idx]["id"] == id: |
| print(total) |
|         if idx == len(hashTable): |
|             return count |
|     idx = id%160 |
|     return 0 |
|             return 0 |
|     for x in range(len(hashTable)): |
| total = 0 |
|         if hashTable[idx] == None: |
|         idx = idx + 1 |
|         continue |
|     count = 0 |
| for item in hashTable: |
|         count = count + 1 |
|     total = total + itemToFind(item["id"]) |
|     if item == None: |
| def itemToFind(id): |
|             idx = 0 |
|         if hashTable[idx]["id"] == id: |
| print(total) |
| 1 | def itemToFind(id): |
| 2 |     idx = id%160 |
| 3 |     count = 0 |
| 4 |     for x in range(len(hashTable)): |
| 5 |         if hashTable[idx] == None: |
| 6 |             return 0 |
| 7 |         if hashTable[idx]["id"] == id: |
| 8 |             return count |
| 9 |         idx = idx + 1 |
| 10 |         count = count + 1 |
| 11 |         if idx == len(hashTable): |
| 12 |             idx = 0 |
| 13 |     return 0 |
| 14 | |
| 15 | total = 0 |
| 16 | for item in hashTable: |
| 17 |     if item == None: |
| 18 |         continue |
| 19 |     total = total + itemToFind(item["id"]) |
| 20 | print(total) |